FAIR PACKET SCHEDULING AND BANDWIDTH MANAGEMENT IN WIRELESS NETWORKS By YING JIAN A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY
نویسندگان
چکیده
of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy FAIR PACKET SCHEDULING AND BANDWIDTH MANAGEMENT IN WIRELESS NETWORKS By Ying Jian December 2008 Chair: Shigang Chen Major: Computer Engineering Our study focused on fair packet scheduling and bandwidth management in CSMA/CA based wireless networks. We address the fairness problem for MAC-layer links and study end-to-end service differentiation and rate assurance for multihop flows. Fine-level rate control, particularly meeting rate requirements and differentiating various types of end-to-end traffic, remains an open problem for multihop wireless networks. Traditionally, rate assurance in wired networks is achieved through resource reservation and admission control, which can be efficiently implemented since the bandwidth capacity of each communication link is known and the sender of a link has the information of all flows that compete for the bandwidth of the link. In a wireless network, however, the capacity of each wireless link can change unpredictably over time due to contention from nearby links and dynamic channel conditions. An end-to-end flow consumes available bandwidth not only at links on its route but also at all nearby contending links, which makes resource reservation extremely complicated. We propose a new adaptive rate control function based on two novel techniques, called proportional packet scheduling (PPS) and dynamic weight adaptation with floor and ceiling (DWA). PPS distributes channel bandwidth among MAC (one-hop) flows in proportion to their weights. DWA adapts flows’ weight according to their rate requirements and priorities. End-to-end traffic is classified into two categories: best-effort flows and QoS flows with rate requirements. The QoS flows are assigned with different
منابع مشابه
Assessment of DSACC and QPART Algorithms in Ad Hoc Networks
The rapid advancement in wireless over wired has augmented the need for improving theQuality of Service (QoS) over such wireless links. However, the wireless ad hoc networkshave too low bandwidth, and establishing a QoS in these networks is a difficult issue. So,support of quality of service in ad hoc networks is the topical issue among the networkscience researchers. In this research we are go...
متن کاملBroadcast Scheduling in Information Delivery Networks
Title of Dissertation: BROADCAST SCHEDULING IN INFORMATION DELIVERY NETWORKS Majid Raissi-Dehkordi, Doctor of Philosophy, 2002 Dissertation directed by: Professor John S. Baras Department of Electrical and Computer Engineering The continuous growth in the demand for access to information and the increasing number of users of the information delivery systems have sparked the need for highly scal...
متن کاملTitle Of Dissertation : UNDERSTANDING AND OPTIMIZING HIGH - SPEED SERIAL MEMORY SYSTEM ARCHITECTURES
Title Of Dissertation: UNDERSTANDING AND OPTIMIZING HIGH-SPEED SERIAL MEMORY SYSTEM ARCHITECTURES Brinda Ganesh, Doctor of Philosophy, 2007 Dissertation Directed by: Professor Bruce Jacob Department of Electrical and Computer Engineering Performance improvements in memory systems have traditionally been obtained by scaling data bus width and speed. Maintaining this trend while continuing to sat...
متن کاملRouting and Scheduling Algorithms in Resource-Limited Wireless Multi-Hop Networks
Title of Dissertation: Routing and Scheduling Algorithms in Resource-limited Wireless Multi-hop Networks Anastassios Michail, Doctor of Philosophy, 2001 Dissertation directed by: Professor Anthony Ephremides Department of Electrical and Computer Engineering The recent advances in the area of wireless networking present novel opportunities for network operators to expand their services to infras...
متن کاملSoft-qos Provisioning Using the Token Bank Fair Queueing Scheduling Algorithm
Future generation wireless packet networks will support multimedia applications with diverse quality-of-service (QoS) requirements. Much of the research on scheduling algorithms has been focused on hard QoS provisioning of integrated services. Although these algorithms give hard delay bounds, their stringent requirements sacrifice the potential statistical multiplexing performance and flexibili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008